Improving the numerical stability of the Sakurai-Sugiura method for quadratic eigenvalue problems
نویسندگان
چکیده
The Sakurai-Sugiura method with Rayleigh-Ritz projection (SS-RR method) finds the eigenvalues in a certain domain of the complex plane of large quadratic eigenvalue problems (QEPs). The SS-RR method can suffer from numerical instability when the coefficient matrices of the projected QEP vary widely in norm. To improve the numerical stability of the SS-RR method, we combine it with a numerically stable eigensolver for the small projected QEP. We analyze the backward stability of the proposed method and show, through numerical experiments, that it computes eigenpairs with backward errors that are smaller than those computed by the SS-RR method.
منابع مشابه
A filter diagonalization for generalized eigenvalue problems based on the Sakurai-Sugiura projection method
The Sakurai-Sugiura projection method, which solves a generalized eigenvalue problem to find certain eigenvalues in a given domain, was reformulated by using the resolvent theory. A new interpretation based on the filter diagonalization was given, and the corresponding filter function was derived explicitly. The block version of the method was also proposed, which enabled to resolve degenerated...
متن کاملA projection method for generalized eigenvalue problems
In this paper, we propose a method for finding certain eigenvalues of a generalized eigenvalue problem that lie in a given domain of the complex plane. The proposed method projects the matrix pencil onto a subspace associated with the eigenvalues that are located in the domain via numerical integration. The projection produces a small pencil with Hankel matrices.
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملA Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملA Subspace Approximation Method for the Quadratic Eigenvalue Problem
Quadratic eigenvalue problems involving large matrices arise frequently in areas such as the vibration analysis of structures, MEMS simulation, and the solution of quadratically constrained least squares problems. The typical approach is to solve the quadratic eigenvalue problem using a mathematically equivalent linearized formulation, resulting in a doubled dimension and a lack of backward sta...
متن کامل